Constructing Minimal Adjacent Dominating Sets in Semigraphs for Clustering in Wireless Networks

Researchers propose Connected Dominating Set (CDS) of graphs in which each node in the cluster wireless network cover via dominating neighbors, define many dominating sets such as strongly connected dominating sets and weakly connected dominating sets etc. In this paper, we extend the dominative capacity of nodes such that each node dominates not only itself and all its adjacent neighbors completely called Adjacent Dominating Set (ADS) in semigraphs. Furthermore, an ADS construction algorithm to find minimal ADS in wireless networks is proposed for cluster head selection. The efficiency and performance of the ADS construction algorithm confirm through theoretical analysis and simulations. This paper addresses the behavior of the protocols in different network model in ADS based cluster network. Simulation result shows that DSR and DSDV perform better in graph and semigraph structure, whereas AODV is more adaptable in the randomly chosen network.